Designing Gabor windows using convex optimization
نویسندگان
چکیده
منابع مشابه
Gabor Dual Spline Windows
An algorithm is presented for constructing dual Gabor window functions that are splines. The spline windows are supported in [−1, 1], with a knot at x = 0, and can be taken C smooth and symmetric. The translation and modulation parameters satisfy 0 < ab ≤ 1/2. The full range 0 < ab < 1 is handled by introducing an additional knot. Many explicit examples are found.
متن کاملDesigning Phononic Crystal with Convex Optimization
Designing phononic crystals by creating frequency bandgaps is of particular interest in elastic and acoustic metamaterial engineering. Mathematically, the problem of optimizing the frequency bandgaps is often nonconvex, as it requires the maximization of the higher indexed eigenfrequency and the minimization of the lower indexed eigenfrequency. A novel algorithm [1] has been previously develope...
متن کاملOnline Convex Optimization Using Predictions
Making use of predictions is a crucial, but under-explored, area of online algorithms. This paper studies a class of online optimization problems where we have external noisy predictions available. We propose a stochastic prediction error model that generalizes prior models in the learning and stochastic control communities, incorporates correlation among prediction errors, and captures the fac...
متن کاملInterconnect Design Using Convex Optimization
Two wire sizing formulations for optimizing interconnect are presented. The rst minimizes the delay under wire width constraints, while the second minimizes the wiring area under delay and width constraints. A convex programming formulation is proposed, and an e cient algorithm is used to perform the optimization. Experimental results show that the rst formulation, which has been the prevalent ...
متن کاملOrbit Learning using Convex Optimization
Recently, learning approaches have been brought to bear on nonlinear datasets by assuming samples lie on a low-dimensional Riemannian manifold in the embedding space. One solution is to model local variations linearly [1]. A fundamental difficulty with such solutions is they cannot extrapolate or generalize far from the training data when the manifold is curved. Consequently, the manifold needs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2018
ISSN: 0096-3003
DOI: 10.1016/j.amc.2018.01.035